Non-volatile memory system having an increased effective number of supported heat levels

ABSTRACT

A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. Moreover, the program instructions are readable and/or executable by a controller to cause the controller to perform a method which includes: assigning data having a first heat to a first data stream, assigning data having a second heat to a second data stream, and writing the data streams simultaneously, in parallel, to page-stripes having a same index across a series of planes of memory. The writing of the first data stream begins at an opposite end of the series of planes as the writing of the second data stream, the writing of the streams being toward one another. Other systems, methods, and computer program products are described in additional embodiments.

BACKGROUND

The present invention relates to non-volatile memory, e.g., such as NANDFlash memory, and more specifically, this invention relates to anon-volatile memory system having an increased effective number ofsupported heat levels without increasing an associated number of blocksopen for writing.

Using Flash memory as an example, the performance characteristics ofconventional NAND Flash-based solid state drives (SSDs) arefundamentally different from those of traditional hard disk drives(HDDs). Data in conventional SSDs is typically organized in pages of 4,8, or 16 KB sizes. Moreover, page read operations in SSDs are typicallyone order of magnitude faster than write operations and latency neitherdepends on the current nor the previous location of operations.

However, in Flash-based SSDs, memory locations are erased in blocksprior to being written to. The size of a minimal erase unit (a block) istypically 256 pages and the erase operations takes approximately oneorder of magnitude more time than a page program operation. Due to theintrinsic properties of NAND Flash, Flash-based SSDs write dataout-of-place whereby a mapping table maps logical addresses of thewritten data to physical ones. This mapping table is typically referredto as the Logical-to-Physical Table (LPT).

As Flash-based memory cells exhibit read errors and/or failures due towear or other reasons, additional redundancy may be used within memorypages as well as across memory chips (e.g., RAID-5 and RAID-6 likeschemes). The additional redundancy within memory pages may includeerror correction code (ECC) which, for example, may include BCH codes.While the addition of ECC in pages is relatively straightforward, theorganization of memory blocks into RAID-like stripes is more complex.For instance, individual blocks are retired over time which requireseither reorganization of the stripes, or capacity reduction of thestripe. As the organization of stripes together with the LPT defines theplacement of data, SSDs typically utilize a Log-Structured Array (LSA)architecture, which combines these two methods.

The LSA architecture relies on out-of-place writes. In this approach, amemory page overwrite will result in writing the memory page data to anew location in memory, marking the old copy of the memory page data asinvalid, and then updating the mapping information. Due to thelimitations of current NAND memory technology, an invalidated datalocation cannot be reused until the entire block it belongs to has beenerased. Before erasing, though, the block undergoes garbage collection,whereby any valid data in the block is relocated to a new block. Garbagecollection of a block is typically deferred for as long as possible tomaximize the amount of invalidated data in block, and thus reduce thenumber of valid pages that are relocated, as relocating data causesadditional write operations, and thereby increases write amplification.

BRIEF SUMMARY

A computer program product, according to one embodiment, includes acomputer readable storage medium having program instructions embodiedtherewith. The computer readable storage medium is not a transitorysignal per se. Moreover, the program instructions readable and/orexecutable by a controller to cause the controller to perform a methodwhich includes: assigning, by the controller, data having a first heatto a first data stream; assigning, by the controller, data having asecond heat to a second data stream; and writing, by the controller, thedata streams simultaneously, in parallel, to page-stripes having a sameindex across a series of planes of memory. The writing of the first datastream begins at an opposite end of the series of planes as the writingof the second data stream, the writing of the streams being toward oneanother.

A computer-implemented method, according to another embodiment,includes: assigning data having a first heat to a first data stream,assigning data having a second heat to a second data stream, and writingthe data streams simultaneously, in parallel, to page-stripes having asame index across a series of planes of memory. The writing of each datastream begins at a starting position between ends of the series ofplanes. Moreover, each data stream is written from the starting positiontoward a respective end of the series of planes.

A system, according to yet another embodiment, includes: a memory, acontroller, and logic integrated with and/or executable by thecontroller. The logic is configured to: assign, by the controller, datahaving a first heat to a first data stream; assign, by the controller,data having a second heat to a second data stream; and write, by thecontroller, the data streams simultaneously, in parallel, topage-stripes having a same index across a series of planes of memory.The writing of each data stream begins at a starting position betweenends of the series of planes. Moreover, each data stream is written fromthe starting position toward a respective end of the series of planes.

Other aspects and embodiments of the present invention will becomeapparent from the following detailed description, which, when taken inconjunction with the drawings, illustrate by way of example theprinciples of the invention.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 shows a non-volatile memory card, in accordance with oneembodiment.

FIG. 2 shows a data storage system architecture, in accordance with oneembodiment.

FIG. 3 is a system diagram, in accordance with one embodiment.

FIG. 4 is a conceptual diagram which includes a block-stripe andpage-stripe, in accordance with one embodiment.

FIG. 5A is a high level illustration of non-volatile memory, inaccordance with one embodiment.

FIG. 5B is a high level illustration of non-volatile memory, inaccordance with one embodiment.

FIG. 5C is a high level illustration of non-volatile memory, inaccordance with one embodiment.

FIGS. 6A-6D are high level illustrations of non-volatile memory, inaccordance with one embodiment.

FIG. 7 is a network architecture, in accordance with one embodiment.

FIG. 8 is a representative hardware environment that may be associatedwith the servers and/or clients of FIG. 7, in accordance with oneembodiment.

FIG. 9 depicts a tiered data storage system in accordance with oneembodiment.

DETAILED DESCRIPTION

The following description is made for the purpose of illustrating thegeneral principles of the present invention and is not meant to limitthe inventive concepts claimed herein. Further, particular featuresdescribed herein can be used in combination with other describedfeatures in each of the various possible combinations and permutations.

Unless otherwise specifically defined herein, all terms are to be giventheir broadest possible interpretation including meanings implied fromthe specification as well as meanings understood by those skilled in theart and/or as defined in dictionaries, treatises, etc.

It must also be noted that, as used in the specification and theappended claims, the singular forms “a,” “an” and “the” include pluralreferents unless otherwise specified. It will be further understood thatthe terms “comprises” and/or “comprising,” when used in thisspecification, specify the presence of stated features, integers, steps,operations, elements, and/or components, but do not preclude thepresence or addition of one or more other features, integers, steps,operations, elements, components, and/or groups thereof. Furthermore, asused herein, the term “about” with reference to some stated value mayrefer to the stated value ±10% of said value.

The following description discloses several preferred embodiments ofdata storage systems, as well as operation and/or component partsthereof. Various embodiments described herein are able to achieve anincreased effective number of supported heat levels in non-volatilememory without increasing an associated number of blocks open forwrites, as will be described in further detail below.

It should be appreciated that various embodiments herein can beimplemented with a wide range of memory mediums, including for examplenon-volatile random access memory (NVRAM) technologies such as NANDFlash memory, NOR Flash memory, phase-change memory (PCM),magnetoresistive RAM (MRAM) and resistive RAM (RRAM). To provide acontext, and solely to assist the reader, various embodiments may bedescribed with reference to a type of non-volatile memory. This has beendone by way of example only, and should not be deemed limiting on theinvention defined in the claims.

In one general embodiment, a method includes assigning data having afirst heat to a first data stream, assigning data having a second heatto a second data stream, and writing the data streams in parallel topage-stripes having a same index across a series of planes of memory.

In another general embodiment, a system includes a memory, and acontroller configured to assign data having a first heat to a first datastream, assigning data having a second heat to a second data stream, andwrite the data streams in parallel to page-stripes having a same indexacross a series of planes of the memory.

In yet another general embodiment, a computer program product includes acomputer readable storage medium having program instructions embodiedtherewith, the program instructions readable and/or executable by acontroller to cause the controller to: assign, by the controller, datahaving a first heat to a first data stream, assign, by the controller,data having a second heat to a second data stream, and write, by thecontroller, the data streams in parallel to page-stripes having a sameindex across a series of planes of memory.

FIG. 1 illustrates a memory card 100, in accordance with one embodiment.It should be noted that although memory card 100 is depicted as anexemplary non-volatile data storage card in the present embodiment,various other types of non-volatile data storage cards may be used in adata storage system according to alternate embodiments. It follows thatthe architecture and/or components of memory card 100 are in no wayintended to limit the invention, but rather have been presented as anon-limiting example.

Moreover, as an option, the present memory card 100 may be implementedin conjunction with features from any other embodiment listed herein,such as those described with reference to the other FIGS. However, suchmemory card 100 and others presented herein may be used in variousapplications and/or in permutations which may or may not be specificallydescribed in the illustrative embodiments listed herein. Further, thememory card 100 presented herein may be used in any desired environment.

With continued reference to FIG. 1, memory card 100 includes a gateway102, a general purpose processor (GPP) 112 (such as an ASIC, FPGA, CPU,etc.) connected to a GPP memory 114 (which may comprise RAM, ROM,battery-backed DRAM, phase-change memory PC-RAM, MRAM, STT-MRAM, etc.,or a combination thereof), and a number of memory controllers 108, whichinclude Flash controllers in the present example. Each memory controller108 is connected to a plurality of NVRAM memory modules 104 (which maycomprise NAND Flash or other non-volatile memory type(s) such as thoselisted above) via channels 106.

According to various embodiments, one or more of the controllers 108 maybe or include one or more processors, and/or any logic for controllingany subsystem of the memory card 100. For example, the controllers 108typically control the functions of NVRAM memory modules 104 such as,data writing, data recirculation, data reading, etc. The controllers 108may operate using logic known in the art, as well as any logic disclosedherein, and thus may be considered as a processor for any of thedescriptions of non-volatile memory included herein, in variousembodiments.

Moreover, the controller 108 may be configured and/or programmable toperform or control some or all of the methodology presented herein.Thus, the controller 108 may be considered to be configured to performvarious operations by way of logic programmed into one or more chips,modules, and/or blocks; software, firmware, and/or other instructionsbeing available to one or more processors; etc., and combinationsthereof.

Referring still to FIG. 1, each memory controller 108 is also connectedto a controller memory 110 which preferably includes a cache whichreplicates a non-volatile memory structure according to the variousembodiments described herein. However, depending on the desiredembodiment, the controller memory 110 may be battery-backed DRAM,phase-change memory PC-RAM, MRAM, STT-MRAM, etc., or a combinationthereof.

As previously mentioned, memory card 100 may be implemented in varioustypes of data storage systems, depending on the desired embodiment. FIG.2 illustrates a data storage system architecture 200 is shown accordingto an exemplary embodiment which is in no way intended to limit theinvention. Moreover, it should be noted that the data storage system 220of FIG. 2 may include various components found in the embodiment of FIG.1.

Looking to FIG. 2, the data storage system 220 comprises a number ofinterface cards 202 configured to communicate via I/O interconnections204 to one or more processor systems 201. The data storage system 220may also comprise one or more RAID controllers 206 configured to controldata storage in a plurality of non-volatile data storage cards 208. Thenon-volatile data storage cards 208 may comprise NVRAM, Flash memorycards, RAM, ROM, and/or some other known type of non-volatile memory.

The I/O interconnections 204 may include any known communicationprotocols, such as Fiber Channel (FC), FC over Ethernet (FCoE),Infiniband, Internet Small Computer System Interface (iSCSI), TransportControl Protocol/Internet Protocol (TCP/IP), Peripheral ComponentInterconnect Express (PCIe), etc., and/or any combination thereof.

The RAID controller(s) 206 in the data storage system 220 may perform aparity scheme similar to that employed by RAID-5, RAID-10, or some othersuitable parity scheme, as would be understood by one of skill in theart upon reading the present descriptions.

Each processor system 201 comprises one or more processors 210 (such asCPUs, microprocessors, etc.), local data storage 211 (e.g., such as RAM814 of FIG. 8, ROM 816 of FIG. 8, etc.), and an I/O adapter 218configured to communicate with the data storage system 220.

Referring again to FIG. 1, memory controllers 108 and/or othercontrollers described herein (e.g., RAID controllers 206 of FIG. 2) maybe able to perform various functions on stored data, depending on thedesired embodiment. Specifically, memory controllers may include logicconfigured to perform any one or more of the following functions, whichare in no way intended to be an exclusive list. In other words,depending on the desired embodiment, logic of a storage system may beconfigured to perform additional or alternative functions, as would beappreciated by one skilled in the art upon reading the presentdescription.

Garbage Collection

Garbage collection in the context of SSD memory controllers of thepresent description may include the process of identifying blocks ofdata to be reclaimed for future usage and relocating all pages that arestill valid therein. Moreover, depending on the specific controllerand/or the respective garbage collection unit of operation,block-stripes may be identified for being reclaimed and/or relocated.

It should also be noted that a block-stripe includes any multiple of thephysical memory block, which is a minimal physical unit of erasure.Moreover, the organization of memory blocks into block-stripes allowsfor adding RAID-like parity protection schemes among memory blocks fromdifferent memory chips, memory planes and/or channels as well assignificantly enhancing performance through higher parallelism.

According to an exemplary embodiment, which is in no way intended tolimit the invention, memory controllers (e.g., see 108 of FIG. 1) mayinternally perform a garbage collection. As previously mentioned, thegarbage collection may include selecting a block-stripe to be relocated,after which all data that is still valid on the selected block-stripemay be relocated (e.g., moved). After the still valid data has beenrelocated, the entire block-stripe may be erased and thereafter, usedfor storing new data. The amount of data relocated from the garbagecollected block-stripe determines the write amplification. Moreover, anefficient way to reduce the write amplification includes implementingheat segregation.

Heat Segregation

In the present context, the “heat” of data refers to the rate (e.g.,frequency) at which the data is updated (e.g., rewritten with new data).Memory blocks that are considered “hot” tend to have a frequent updatedrate, while memory blocks that are considered “cold” have an update rateslower than hot blocks.

Data heat may be determined by monitoring the data and ascertaining anoverwrite frequency, implementing an application which indicates theheat of data to be written, implementing a container marker, etc.Illustrative embodiments for monitoring and/or determining heat of dataare presented in U.S. Pat. No. 8,463,983, which is herein incorporatedby reference. Other known techniques for monitoring and/or determiningheat of data may be used.

It should be noted that the number of read requests to and/or readoperations performed on a memory block may not come into play whendetermining the heat of the memory block for some embodiments. Forexample, if data is frequently read from a particular memory block, thehigh read frequency does not necessarily mean that memory block willalso have a high update rate. Rather, a high frequency of readoperations performed on a given memory block may denote an importance,value, etc. of the data stored in the memory block.

By grouping memory blocks of the same and/or similar heat values, heatsegregation may be achieved. In particular, heat segregating methods maygroup hot memory pages together in certain memory blocks while coldmemory pages are grouped together in separate memory blocks. Thus, aheat-segregated block-stripe tends to be occupied by either hot or colddata.

The merit of heat segregation is two-fold. First, performing a garbagecollection process on a hot memory block will prevent triggering therelocation of cold data as well. In the absence of heat segregation,updates to hot data, which are performed frequently, also results in theundesirable relocations of all cold data collocated on the sameblock-stripe as the hot data being relocated. Therefore the writeamplification incurred by performing garbage collection is much lowerfor embodiments implementing heat segregation.

Secondly, the relative heat of data can be utilized for wear levelingpurposes. For example, hot data may be placed in younger (e.g.,healthier) memory blocks, while cold data may be placed on older (e.g.,less healthy) memory blocks relative to those younger memory blocks.Thus, the rate at which relatively older blocks are exposed to wear iseffectively slowed, thereby improving the lifetime of a given datastorage system implementing heat segregation.

For these reasons, it is desirable to have the ability to implement asmany levels of heat as possible in a non-volatile memory device, e.g.,to achieve an accurate heat estimation. However, previous attempts toimplement heat segregation in conventional non-volatile memorycontrollers have fallen short of producing desired results.Specifically, the number of achievable heat levels in conventionalhardware is limited by several factors, one being the number of openblock-stripes.

An open block-stripe is a set of blocks that use separate flashchannels, and therefore can be written (e.g., programmed) in parallel.All blocks in an open block-stripe have already been erased, and areready to be written to with valid user data. It should be noted that thetime taken to write new data to an erased block-stripe may be relativeto the heat of the data. For example, hot data may be written to theblock-stripe in several seconds or less, whereas cold data may bewritten to the block-stripe over minutes, hours, days, etc.

Various embodiments described herein include non-volatile memorycontroller architectures capable of overcoming conventionalshortcomings, as will be described in further detail below. It followsthat various embodiments described herein may preferably be implementedin combination with a memory controller which is capable of tracking theheat of data. For example, various memory controllers described hereinmay be able to track the heat of logical and/or physical pages, memoryblocks, etc. However, it should again be noted that various embodimentsherein may be implemented with a wide range of memory mediums, e.g.,NVRAM based SSD controllers, and the explicit reference to particulartypes of NVRAM is in no way intended to limit the invention.

Write Allocation

Write allocation includes placing data of write operations into freelocations of open block-stripes. As soon as all pages in a block-stripehave been written, the block-stripe is closed and placed in a poolholding occupied block-stripes. Typically, block-stripes in the occupiedpool become eligible for garbage collection. The number of openblock-stripes is normally limited and any block-stripe being closed maybe replaced, either immediately or after some delay, with a freshblock-stripe that is being opened.

During performance, garbage collection may take place concurrently withuser write operations. For example, as a user (e.g., a host) writes datato a device, the device controller may continuously perform garbagecollection on block-stripes with invalid data to make space for the newincoming data pages. As mentioned above, the block-stripes having thegarbage collection being performed thereon will often have some pagesthat are still valid at the time of the garbage collection operation;thus, these pages are preferably relocated (e.g., written) to a newblock-stripe.

Again, the foregoing functions are in no way intended to limit thecapabilities of any of the storage systems described and/or suggestedherein. Rather, the aforementioned functions are presented by way ofexample, and depending on the desired embodiment, logic of a storagesystem may be configured to perform additional or alternative functions,as would be appreciated by one skilled in the art upon reading thepresent description.

As described above, previous attempts to implement heat segregation inconventional non-volatile memory controllers have fallen short ofproducing desired effects. In sharp contrast, various embodimentsdescribed herein include novel non-volatile memory controllercapabilities which overcome conventional shortcomings.

Specifically, different embodiments herein may include a modification tothe data placement policy of the incoming user data, which may desirablyachieve improved separation of data streams. Various embodiments hereinmay group data having different, yet similar, heats (e.g., ice-cold andcold, or hot and very hot) such that the different groups of data arewritten to different open block-stripes. However, data having first andsecond heats (corresponding to streams) of each group of data may bewritten to a common plurality of open block-stripes across a series ofplanes. It is preferred, but in no way required, that data of first andsecond heats written to a common series of planes (plurality of openblock-stripes) are more similar to each other than a third heat withwhich data is associated. Thus, for example, it is preferred that hotand moderately hot data be written to a common plurality of openblock-stripes across a series of planes, as opposed to grouping colddata with either of the hot or moderately hot data to be writtenthereto. According to an example, which is in no way intended to limitthe invention, very hot data may be written to block-stripes open onplanes with lower indexes in a series of planes, while moderately hotdata is written to the block-stripes open on planes with higher indexesin the series of planes. As a result, various embodiments describedherein are able to achieve a best-effort separation of data heatswithout requiring an increased number of open block-stripes.Accordingly, the ratio of introduced complexity with respect to theachieved level of separation achieved herein is exceptionallysatisfactory for various workloads, as will be described in furtherdetail below. It should also be noted that a particular “data stream”may be used herein to refer to data having the same heat.

Moreover, continuing with the foregoing example where very hot data iswritten to the open block-stripes of planes with lower indexes, whilemoderately hot data is written to the open block-stripes of planes withhigher indexes, a third stream, e.g., of cold data, may be written to adifferent open block-stripe in parallel with the writing of the hot andvery hot data. Further, a third and fourth stream, e.g., of cold andmoderately cold data, may be written in parallel to different openblock-stripes.

Referring now to FIG. 3, a system 300 is illustrated in accordance withone embodiment. As an option, the present system 300 may be implementedin conjunction with features from any other embodiment listed herein,such as those described with reference to the other FIGS. However, suchsystem 300 and others presented herein may be used in variousapplications and/or in permutations which may or may not be specificallydescribed in the illustrative embodiments listed herein. Further, thesystem 300 presented herein may be used in any desired environment,e.g., in combination with a controller.

As illustrated, system 300 includes a write cache 302 which is coupledto several other components, including garbage collector 304. Aspreviously mentioned, garbage collector 304 may be used to freememory-blocks by relocating valid data and providing non-volatile memoryblocks to be erased for later reuse. Thus the garbage collector 304 mayreclaim blocks of consecutive physical space, depending on the desiredembodiment. According to an exemplary embodiment, block erase units maybe used to keep track of and/or complete the erase of non-volatilememory blocks handed over by the garbage collector 304.

Write cache 302 is also coupled to free block manager 306 which may keeptrack of free non-volatile memory blocks after they have been erased.Moreover, as would be appreciated by one of ordinary skill in the artupon reading the present description, the free block manager 306 maybuild free stripes of non-volatile memory blocks from different lanes(e.g., block-stripes) using the erased free non-volatile memory blocks.

Referring still to FIG. 3, write cache 302 is coupled to LPT manager 308and memory I/O unit 310. The LPT manager 308 maintains thelogical-to-physical mappings of logical addresses to physical pages inmemory. According to an example, which is in no way intended to limitthe invention, the LPT manager 308 may maintain the logical-to-physicalmappings of 4 KiB logical addresses. The memory I/O unit 310communicates with the memory chips in order to perform low leveloperations, e.g., such as reading one or more non-volatile memory pages,writing a non-volatile memory page, erasing a non-volatile memory block,etc.

To better understand the distinction between block-stripes andpage-stripes as used herein, FIG. 4 is a conceptual diagram 400, inaccordance with one embodiment. As an option, the present conceptualdiagram 400 may be implemented in conjunction with features from anyother embodiment listed herein, such as those described with referenceto the other FIGS. However, such conceptual diagram 400 and otherspresented herein may be used in various applications and/or inpermutations which may or may not be specifically described in theillustrative embodiments listed herein. Further, the controllerconceptual diagram 400 presented herein may be used in any desiredenvironment. Thus, the exemplary non-volatile memory controllerconceptual diagram 400 of FIG. 4 may be implemented in a cachearchitecture according to the desired embodiment.

Looking now to FIG. 4, the conceptual diagram 400 includes a set of M+1planes labeled “Plane 0” through “Plane M”. Each plane is shown asincluding 11 blocks of N+1 pages labeled “Page 0” through “Page N”, and11 channels labeled “Channel 0” through “Channel 10” as shown in theexploded view of Plane 0. In different embodiments, the number of pagesin each block and/or the number of channels in each plane may varydepending on the desired embodiment. According to an exemplaryembodiment, which is in no way intended to limit the invention, a blockmay include 256 pages, but could include more or less in variousembodiments.

Each block of pages constitutes a unique block. Similarly, each channelcorresponds to a single, individual block. For example, looking toconceptual diagram 400, Block 0 includes all pages (Page 0 through PageN) in Channel 0 while Block 4 corresponds to all pages in Channel 4, andso on.

In the context of a memory controller, e.g., which may be capable ofimplementing RAID at the channel level, a block-stripe is made up ofmultiple blocks which amount to a stripe of blocks. Looking still toFIG. 4, the multiple blocks of Plane 0 constitute Block-stripe 0. Whileall blocks in a block-stripe typically belong to the same plane, in someembodiments one or more blocks of a block-stripe may belong to differentplanes. It follows that each plane may include a block-stripe. Thus,according to an illustrative embodiment, Block 0 through Block 10 mayconstitute a block-stripe.

Referring still to FIG. 4, all pages in a block-stripe with the samepage index denote a page-stripe. For example, Page-stripe 0 includes thefirst page (Page 0) of each channel in Block-stripe 0 of Plane 0.Similarly, Page-stripe N includes the last page (Page N) of each channelin Block-stripe 0 of Plane 0.

As previously mentioned, any of the embodiments described herein mayimplement heat tracking and/or segregation of data, e.g., using a memorycontroller. Specifically, according to some embodiments, the temperatureof a datum (e.g., a 4 KiB logical page, physical page, a non-volatilememory block, a block-stripe, etc.) in the context of heat segregationmay be categorized based on the update frequency of that datum. However,heat tracking and/or segregation may include a variety of designchoices. For example, the granularity of a datum at which heat(temperature) is tracked, the resolution of the heat, the procedure usedto update the heat, the resolution at which data segregation isperformed (e.g., the number of streams), and/or the mapping of one ormore heat values to a given stream may be designated as modifiabledesign parameters in a heat segregating scheme.

Specifically, different embodiments herein may include a modification tothe data placement policy of the incoming user data, which may desirablyachieve improved separation of data streams. Various embodiments hereinmay group data having different, and possibly similar, heats (e.g.,ice-cold and cold, hot and very hot, hot and cold) such that the data ineach stream is written from opposite ends of a plurality of openblock-stripes spanning across a series of planes. Thus, the heat of thedata being stored in memory may determine the location it is written to.

According to an example, which is in no way intended to limit theinvention, very hot data may be written to block-stripes open on planeswith lower indexes of a series of planes, advancing towards planes withhigher indexes (e.g., from left to right in FIG. 5A), while moderatelyhot data is written to the block-stripes open on planes with higherindexes of the series of planes, advancing towards the planes with lowerindexes (e.g., from right to left in FIG. 5A). As a result, variousembodiments described herein are able to achieve a best-effortseparation of data heats without requiring an increased number of openblock-stripes. Moreover, the ratio of introduced complexity with respectto the achieved level of separation achieved herein is exceptionallysatisfactory for various workloads. Therefore, although eachblock-stripe of various embodiments described herein may hold data frommore than one data stream, data segregation of such block-stripesremains desirably high, as will be described in further detail below.

Looking to FIGS. 5A-5C, high level illustrations 500, 550, 560 ofnon-transitory memory are shown in accordance with two embodiments. Asan option, the present high level illustrations 500, 550, 560 may beimplemented in conjunction with features from any other embodimentlisted herein, such as those described with reference to the otherFIGS., such as FIG. 4. However, such high level illustrations 500, 550,560 and others presented herein may be used in various applicationsand/or in permutations which may or may not be specifically described inthe illustrative embodiments listed herein. Further, the high levelillustrations 500, 550, 560 presented herein may be used in any desiredenvironment. Thus FIGS. 5A-5C (and the other FIGS.) may be deemed toinclude any possible permutation.

The high level illustrations 500, 550, 560 include plane-level views ofnon-transitory memory. Moreover, the embodiments illustrated in FIGS.5A-5C are able to fill open page-stripes from opposite sides of openblock-stripes spanning across a series of planes with data havingsimilar, yet different heat levels while maintaining segregationtherebetween. Data of the same heat may be assigned to a correspondingdata stream. Thus, hot data may be assigned to a hot data stream whilemoderately hot data may be assigned to a moderately hot data stream.

Referring specifically now to FIG. 5A, high level illustration 500includes hot data 502 from a hot data stream being written to pages ofthe planes beginning at a leftmost page of a page-stripe in a firstplane (Plane 0) and continuing towards a rightmost page of a page-stripein the last plane (Plane M) of a series of planes. However, moderatelyhot data 504 from a moderately hot data stream is also written to thepage-stripes which the hot data is currently being written to, yetbeginning at a rightmost page of the page-stripe in the last plane(Plane M) and continuing towards a leftmost page of the page-stripe inthe first plane (Plane 0). Therefore, the writing of each data streambegins at opposite ends of the series of planes, and continues towardsone another as indicated by the arrows shown inside each plane of FIG.5A, which have been included to represent an intended direction in whicheach data stream is filled into a given page-stripe according to anillustrative embodiment.

Accordingly, hot data 502 and moderately hot data 504 of the datastreams is written in parallel to page-stripes having a same indexacross a series of planes of memory from opposite ends thereof. As aresult of the parallel writing, hot data 502 and moderately hot data 504eventually meet at a junction 506. Thus, a junction 506 may be definedin a page-stripe of a plane where the data of the two data streams meet.Depending on the rate at which data is written to the page-stripes ofthe block-stripes, the location of the junction 506 along the length ofthe page-stripes across the series of planes may vary. For example, thehigher update rate of hot data relative to the relatively lower updaterate of moderately hot data may have an effect on the location of one ormore of the junctions 506. Accordingly, FIG. 5A illustrates the hot data502 having filled a larger portion of the page-stripes on Plane M thanthe moderately hot data 504.

The organization of data presented in FIG. 5A more efficiently fills theblock-stripes, e.g., compared to conventional products. For example,conventional products assign a unique block-stripe to each data stream,whereby, if an incoming data rate of one or more of the data streamsdecreases for a period of time, the corresponding block-stripe(s) may beunused. In sharp contrast, referring again to the data organizationpresented in the embodiment illustrated in FIG. 5A, filling page-stripesof block-stripes simultaneously from opposing ends of a series of planesallows for continued use of the memory despite a possible decrease indata rate of one of the data streams. Depending on the amount a datarate is increased, the time the data rate is decreased for, etc.,junctions 506 may be positioned differently along the series of planes.According to an example, which is in no way intended to limit theinvention, if a first data stream of a pair of data streams filling agiven series of planes decreases to a point that no data is beingreceived, the other of the two data streams may fill all pages of agiven page-stripe across all planes, depending on the amount of timeuntil writing of data in the first data stream resumes.

The organization of data also achieves a desired separation of datahaving different temperatures. According to the present embodiment,pages to the left of the junctions 506 hold hot data while pages to theright of the junctions 506 hold moderately hot data. It follows that thejunctions 506 define a clear boundary separating data having slightlydifferent temperatures.

Although the organization of data within illustration 500 of FIG. 5Adepicts the junctions between data of different temperatures as beinglocated in a final plane of a block-stripe (Plane M), as alluded toabove, junctions between data of different temperatures may be locatedat any point along a given series of planes and/or block-stripe withinthe series of planes, depending on the update rate of the data. Thus,according to some embodiments, junctions between data of twotemperatures may be located in a block-stripe at about the center of aseries of planes. For example, FIG. 5B illustrates an embodiment inwhich the junctions between moderately hot data and hot data are locatedin a block-stripe at about the middle of the series of planes, e.g.,plane (M+1)/2.

Referring now to FIG. 5B, the high level illustration 550 depicts asimilar separation of data streams achieved between moderately cold data552 and cold data 554 for an embodiment having three planes. It shouldbe noted that, although the present embodiment is depicted as havingthree distinct planes, similar and/or the same results may be achievedfor embodiments having any number of additional planes, e.g., 4 planes,5 planes, 10 planes, M planes, etc., depending on the desiredembodiment. The value for M may be selected based on the configurationof the particular system in this and other embodiments.

With continued reference to FIG. 5B, all pages of all planes in thepresent embodiment have been filled with data. As described above, datastreams having different heats fill the block-stripes from oppositesides of a series of planes. In the present embodiment, moderately colddata 552 is filled into each of the page-stripes from left to rightbeginning at Plane 0, while cold data 554 is filled into each of thecorresponding page-stripes from right to left beginning at Plane 2.Thus, junctions 556 between moderately cold data 552 and cold data 554are located in page-stripes of Plane 1. Moreover, block-stripes of theplanes to either side of Plane 1 are filled exclusively with data of acommon heat. Looking to the high level illustration 550, all pages ofPlane 0 contain exclusively moderately cold data 552, while all pages ofPlane 2 contain exclusively cold data 554. As a result, completeseparation of data heats is achieved.

The same effect may be achieved for embodiments having more than threeplanes. For example, a middle plane (e.g., Plane 3) of an embodimenthaving seven planes (Plane 0 through Plane 6) may include junctionsbetween data of two different heats, while the remainder of the planescontain data exclusive to a given heat and thereby attain completeseparation between the data heats.

Furthermore, separation of data heats according to any of theembodiments described herein may be implemented in a single page-stripe,e.g., in embodiments having a single plane.

As previously mentioned, the organization of data in the embodimentsdepicted in FIGS. 5A-5C achieves a clear boundary separating data havingdifferent temperatures. Although page-stripes of planes in whichjunctions 506 are located may include data of different heats, theembodiment as a whole is able to desirably achieve improved separationof data by streams. Moreover, various embodiments described and/orsuggested herein may be able to achieve separation of heats that is upto about two times better than conventional products.

Although both embodiments illustrated in FIGS. 5A-5B depict thejunctions 506, 556 as being located in a common plane (i.e., Plane M andPlane 1 respectively), junctions may occur between data streams ofdifferent temperatures across different planes. For example, looking toFIG. 5C, the high level illustration 560 depicts an exemplary embodimentin which the junctions 566 between hot data 562 and moderately hot data564 are located in more than one plane. In this example, the junction566 between the data 562, 564 in Page-stripe 0 are located in Plane 2,while the junctions 566 between the data 562, 564 in Page-stripe 1 andPage-stripe 3 are located in Plane 1. The data 562 in Page-stripe 2extends across all Planes, inferring that the rate of writing data 562was higher than that for data 564. Again, depending on the rate at whichdata is written to the page-stripes of the block-stripes in a series ofplanes over time, the location of each of the junctions 566 along thelength of the series of planes may vary.

It may also be desirable, but in no way required, for embodimentsimplementing an organization of data as presented in the variousembodiments described herein (e.g., as seen in FIGS. 5A-5C) to implementrotating heat assignments, as will soon become apparent. Referringmomentarily to the embodiment illustrated in FIG. 5A, hot data 502 iswritten to pages of the planes beginning at a leftmost page of aleftmost plane and continuing to the right, while moderately hot data504 is written to pages of the planes beginning at a rightmost page of arightmost plane and continuing to the left. It follows that, withcontinued use over time, planes with lower indexes (e.g. Plane 0 andPlane 1) will be filled with hotter data than those planes with higherindexes (e.g., Plane M and Plane M−1). Thus, planes having lower indexesmay be written (e.g., updated) more often than those planes havinghigher indexes, and as a result, experience more wear over a givenperiod of time.

Differences in wear across the different planes of a given embodimentmay be undesirable in view of wear leveling and health management.Specifically, portions of memory which experience higher amounts of wearmay fail sooner than portions which experience lower amounts of wear. Itfollows that it may be desirable for various embodiments describedherein to implement rotating heat assignments.

FIGS. 6A-6D depict high level illustrations of memory 600, in accordancewith one embodiment. As an option, the present high level illustrationsof memory 600 may be implemented in conjunction with features from anyother embodiment listed herein, such as those described with referenceto the other FIGS., such as FIGS. 5A-5C. However, such high levelillustrations of memory 600 and others presented herein may be used invarious applications and/or in permutations which may or may not bespecifically described in the illustrative embodiments listed herein.Further, the high level illustrations of memory 600 presented herein maybe used in any desired environment. Thus FIGS. 6A-6D (and the otherFIGS.) may be deemed to include any possible permutation.

The series of planes depicted in the high level illustrations of memory600 may incorporate the same or similar structure as that illustrated inthe exploded view of Plane 0 in FIG. 4. Thus, as described above, eachplane of the memory 600 may include block-stripes, page-stripes, etc.Furthermore, it should be noted that the starting position 602 includedin the embodiment of FIGS. 6A-6D is intended to represent an imaginaryboundary separating a starting position for each of the data streams, aswill be described in further detail below. Arrows have been included inFIGS. 6A-6B which are intended to represent a direction in which each ofthe hot and moderately hot data streams are filled into memory,according to an illustrative embodiment.

Referring now specifically to FIG. 6A, starting position 602 is locatedat position 0, e.g., at the leftmost portion of Plane 0. Thus, hot datais filled into the block-stripes of memory 600 beginning at a firstblock of Plane 0 and continues filling the series of planes from left toright. Furthermore, moderately hot data is filled into the block-stripesof memory 600 beginning at a last block of Plane M and continues fillingthe series of planes from right to left. As previously mentioned, thewriting of each data stream preferably begins at the starting position602 between ends of the series of planes. Moreover, data of each datastream is written from the starting position 602 towards a respectiveend of the series of planes. The organization of data resulting from thestarting position 602 being located at position 0 would match, or atleast resemble (e.g., depending on incoming data rates) the organizationof data presented in the embodiments corresponding to FIGS. 5A-5C.

However, as previously mentioned, it may be desirable to shift thestarting position 602 (e.g., the page to which data is first written to)after an amount of time, some writing is performed, etc., which may bepredetermined, calculated, updated, etc., depending on the desiredembodiment. Thus, the writing of each data stream may begin at astarting position between outer planes, here at some position betweenPlane 0 and Plane M. For example, looking to FIG. 6B, the startingposition 602 is illustrated as having been moved to position 1, locatedbetween Plane 0 and Plane 1. As a result, moderately hot data is filledinto the block-stripes of memory 600 beginning at a last block of Plane0 and continues from right to left. Furthermore, hot data is filled intothe block-stripes beginning at a first block of Plane 1 and continuesfilling the series of planes from left to right. When the moderately hotdata reaches the leftmost page of Plane 0 in Page-stripe 0, moderatelyhot data may be written to the right-most page of Page-stripe 0 in PlaneM, and writing from right to left until reaching the hot data, uponwhich a junction is defined. Accordingly, the Page-stripes of a givenindex are each filled before proceeding to writing to Page-stripes ofsubsequent indexes, where writing may again begin at the startingposition 602, or at another position if the starting position isadvanced.

FIG. 6C depicts the starting position 602 having been advanced to athird position between Plane 2 and Plane 1. According to the presentembodiment, the third position results in hot data filling into theblock-stripes beginning at a first block of Plane 2 and continuing fromleft to right, while moderately hot data is filled into theblock-stripes beginning at a last block of Plane 1 and continuing fromright to left.

Referring to FIG. 6D, the starting position 602 may be advanced in asimilar manner until reaching a position between Plane M and Plane M−1.According to one embodiment, if it is desired to further advance thestarting position 602 past Plane M, the starting position may instead beadvanced to position 0, e.g., as a result of the indexes beingcircularly rotated. However, rather than implementing a startingposition which circularly rotates to the right, alternate embodimentsmay implement a starting position which circularly rotates to the left.In other embodiments, starting position 602 may proceed towards Plane M,and at some point reverse direction towards position 0. Further still,the starting position may skip over certain planes when advanced, e.g.,to prevent additional wear to certain planes. It follows that variousembodiments may implement different shifting heat assignments, e.g.,depending on the desired embodiment.

Implementing a starting position which shifts between block-stripeboundaries, e.g., between planes, may desirably achieve completesegregation of data in particular block-stripes. Thus, although thejunctions between data streams of different heats may be positioned indifferent locations for each page-stripe, most block-stripes in the sameset may include page-stripes having data of the same heat.

Furthermore, garbage collection typically operates on the block-stripelevel. Thus, in view of the foregoing embodiments, invalidations of datastored in a block-stripe may occur about concurrently, thereby reducingwrite amplification of block-stripes.

It follows that the various embodiments described herein are able toeffectively double the number of supported heat levels in non-volatilememory without increasing an associated number of open block-stripes.

In addition to the features presented above, memory controllers maybuffer incoming data (writes) to a write cache, e.g., per data streamand corresponding to an associated page. After a desired amount of datais buffered in cache (e.g., an amount of data capable of achievingparallelism), the data may be written to memory. The organization of thewrite cache may vary depending on the desired embodiment, as would beappreciated by one skilled in the art upon reading the presentdescription. Thus, it follows that any of the teachings presented hereinmay be applied to various types of write caches, and even to systemsthat do not have a write cache. In other words, the embodimentsdescribed and/or suggested herein may be applied to various types ofwrite caches and/or systems which write user data directly to memory,e.g., without buffering the user data first in a write cache.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

Moreover, a system according to various embodiments may include aprocessor and logic integrated with and/or executable by the processor,the logic being configured to perform one or more of the process stepsrecited herein. By integrated with, what is meant is that the processorhas logic embedded therewith as hardware logic, such as an applicationspecific integrated circuit (ASIC), a field programmable gate array(FPGA), etc. By executable by the processor, what is meant is that thelogic is hardware logic; software logic such as firmware, part of anoperating system, part of an application program; etc., or somecombination of hardware and software logic that is accessible by theprocessor and configured to cause the processor to perform somefunctionality upon execution by the processor. Software logic may bestored on local and/or remote memory of any memory type, as known in theart. Any processor known in the art may be used, such as a softwareprocessor module and/or a hardware processor such as an ASIC, a FPGA, acentral processing unit (CPU), an integrated circuit (IC), a graphicsprocessing unit (GPU), etc.

It will be clear that the various features of the foregoing systemsand/or methodologies may be combined in any way, creating a plurality ofcombinations from the descriptions presented above.

While various embodiments have been described above, it should beunderstood that they have been presented by way of example only, and notlimitation. Thus, the breadth and scope of a preferred embodiment shouldnot be limited by any of the above-described exemplary embodiments, butshould be defined only in accordance with the following claims and theirequivalents.

FIG. 7 illustrates a network architecture 700, in accordance with oneembodiment. As shown in FIG. 7, a plurality of remote networks 702 areprovided including a first remote network 704 and a second remotenetwork 706. A gateway 701 may be coupled between the remote networks702 and a proximate network 708. In the context of the present networkarchitecture 700, the networks 704, 706 may each take any formincluding, but not limited to a LAN, a WAN such as the Internet, publicswitched telephone network (PSTN), internal telephone network, etc.

In use, the gateway 701 serves as an entrance point from the remotenetworks 702 to the proximate network 708. As such, the gateway 701 mayfunction as a router, which is capable of directing a given packet ofdata that arrives at the gateway 701, and a switch, which furnishes theactual path in and out of the gateway 701 for a given packet.

Further included is at least one data server 714 coupled to theproximate network 708, and which is accessible from the remote networks702 via the gateway 701. It should be noted that the data server(s) 714may include any type of computing device/groupware. Coupled to each dataserver 714 is a plurality of user devices 716. Such user devices 716 mayinclude a desktop computer, laptop computer, handheld computer, printer,and/or any other type of logic-containing device. It should be notedthat a user device 711 may also be directly coupled to any of thenetworks, in some embodiments.

A peripheral 720 or series of peripherals 720, e.g., facsimile machines,printers, scanners, hard disk drives, networked and/or local datastorage units or systems, etc., may be coupled to one or more of thenetworks 704, 706, 708. It should be noted that databases and/oradditional components may be utilized with, or integrated into, any typeof network element coupled to the networks 704, 706, 708. In the contextof the present description, a network element may refer to any componentof a network.

According to some embodiments, methods and systems described herein maybe implemented with and/or on virtual systems and/or systems whichemulate one or more other systems, such as a UNIX system which virtuallyhosts a MICROSOFT WINDOWS environment, etc. This virtualization and/oremulation may be enhanced through the use of VMWARE software, in someembodiments.

In other embodiments, one or more networks 704, 706, 708, may representa cluster of systems commonly referred to as a “cloud.” In cloudcomputing, shared resources, such as processing power, peripherals,software, data, servers, etc., are provided to any system in the cloudin an on-demand relationship, thereby allowing access and distributionof services across many computing systems. Cloud computing typicallyinvolves an Internet connection between the systems operating in thecloud, but other techniques of connecting the systems may also be used,as known in the art.

FIG. 8 shows a representative hardware environment associated with auser device 716 and/or server 714 of FIG. 7, in accordance with oneembodiment. FIG. 8 illustrates a typical hardware configuration of aprocessor system 800 having a central processing unit 810, such as amicroprocessor, and a number of other units interconnected via a systembus 812, according to one embodiment. In some embodiments, centralprocessing unit 810 may include any of the embodiments described abovewith reference to the one or more processors 210 of FIG. 2.

The processor system 800 shown in FIG. 8 includes a Random Access Memory(RAM) 814, Read Only Memory (ROM) 816, and an I/O adapter 818. Accordingto some embodiments, which are in no way intended to limit theinvention, I/O adapter 818 may include any of the embodiments describedabove with reference to I/O adapter 218 of FIG. 2. Referring still toprocessor system 800 of FIG. 8, the aforementioned components 814, 816,818 may be used for connecting peripheral devices such as storagesubsystem 820 to the bus 812. In some embodiments, storage subsystem 820may include a similar and/or the same configuration as data storagesystem 220 of FIG. 2. According to an example, which is in no wayintended to limit the invention, storage subsystem 820 may includenon-volatile data storage cards, e.g., having Flash memory cards, RAM,ROM, and/or some other known type of non-volatile memory, in addition toRAID controllers as illustrated in FIG. 2.

With continued reference to FIG. 8, a user interface adapter 822 forconnecting a keyboard 824, a mouse 826, a speaker 828, a microphone 832,and/or other user interface devices such as a touch screen, a digitalcamera (not shown), etc., to the bus 812.

Processor system 800 further includes a communication adapter 834 whichconnects the processor system 800 to a communication network 835 (e.g.,a data processing network) and a display adapter 836 which connects thebus 812 to a display device 838.

The processor system 800 may have resident thereon an operating systemsuch as the MICROSOFT WINDOWS Operating System (OS), a MAC OS, a UNIXOS, etc. It will be appreciated that a preferred embodiment may also beimplemented on platforms and operating systems other than thosementioned. A preferred embodiment may be written using JAVA, XML, C,and/or C++ language, or other programming languages, along with anobject oriented programming methodology. Object oriented programming(OOP), which has become increasingly used to develop complexapplications, may be used.

Moreover, FIG. 9 illustrates a storage system 900 which implements highlevel (e.g., SSD) storage tiers in combination with lower level (e.g.,magnetic tape) storage tiers, according to one embodiment. Note thatsome of the elements shown in FIG. 9 may be implemented as hardwareand/or software, according to various embodiments. The storage system900 may include a storage system manager 912 for communicating with aplurality of media on at least one higher storage tier 902 and at leastone lower storage tier 906. However, in other embodiments, a storagesystem manager 912 may communicate with a plurality of media on at leastone higher storage tier 902, but no lower storage tier. The higherstorage tier(s) 902 preferably may include one or more random accessand/or direct access media 904, such as hard disks, nonvolatile memory(NVM), solid state memory in SSDs, Flash memory, SSD arrays, Flashmemory arrays, etc., and/or others noted herein or known in the art.According to illustrative examples, FIGS. 3-4 show exemplaryarchitectures of SSD systems which may be used as a higher storage tier902 depending on the desired embodiment.

Referring still to FIG. 9, the lower storage tier(s) 906 preferablyincludes one or more lower performing storage media 908, includingsequential access media such as magnetic tape in tape drives and/oroptical media, slower accessing HDDs, slower accessing SSDs, etc.,and/or others noted herein or known in the art. One or more additionalstorage tiers 916 may include any combination of storage memory media asdesired by a designer of the system 900. Thus the one or more additionalstorage tiers 916 may, in some embodiments, include a SSD systemarchitecture similar or the same as those illustrated in FIGS. 1-2.Also, any of the higher storage tiers 902 and/or the lower storage tiers906 may include any combination of storage devices and/or storage media.

The storage system manager 912 may communicate with the storage media904, 908 on the higher storage tier(s) 902 and lower storage tier(s) 906through a network 910, such as a storage area network (SAN), as shown inFIG. 9, or some other suitable network type. The storage system manager912 may also communicate with one or more host systems (not shown)through a host interface 914, which may or may not be a part of thestorage system manager 912. The storage system manager 912 and/or anyother component of the storage system 900 may be implemented in hardwareand/or software, and may make use of a processor (not shown) forexecuting commands of a type known in the art, such as a centralprocessing unit (CPU), a field programmable gate array (FPGA), anapplication specific integrated circuit (ASIC), etc. However, anyarrangement of a storage system may be used, as will be apparent tothose of skill in the art upon reading the present description.

In more embodiments, the storage system 900 may include any number ofdata storage tiers, and may include the same or different storage memorymedia within each storage tier. For example, each data storage tier mayinclude the same type of storage memory media, such as HDDs, SSDs,sequential access media (tape in tape drives, optical disk in opticaldisk drives, etc.), direct access media (CD-ROM, DVD-ROM, etc.), or anycombination of media storage types. In one such configuration, a higherstorage tier 902, may include a majority of SSD storage media forstoring data in a higher performing storage environment, and remainingstorage tiers, including lower storage tier 906 and additional storagetiers 916 may include any combination of SSDs, HDDs, tape drives, etc.,for storing data in a lower performing storage environment. In this way,more frequently accessed data, data having a higher priority, dataneeding to be accessed more quickly, etc., may be stored to the higherstorage tier 902, while data not having one of these attributes may bestored to the additional storage tiers 916, including lower storage tier906. However, one of skill in the art, upon reading the presentdescriptions, may devise many other combinations of storage media typesto implement into different storage schemes, according to theembodiments presented herein.

According to some embodiments, the storage system (such as 900) mayinclude logic configured to receive a request to open a data set, logicconfigured to determine if the requested data set is stored to a lowerstorage tier 906 of a tiered data storage system 900 in multipleassociated portions, logic configured to move each associated portion ofthe requested data set to a higher storage tier 902 of the tiered datastorage system 900, and logic configured to assemble the requested dataset on the higher storage tier 902 of the tiered data storage system 900from the associated portions.

Of course, this logic may be implemented as a method on any deviceand/or system or as a computer program product, according to variousembodiments.

What is claimed is:
 1. A computer program product comprising a computerreadable storage medium having program instructions embodied therewith,wherein the computer readable storage medium is not a transitory signalper se, the program instructions readable and/or executable by acontroller to cause the controller to perform a method comprising:assigning, by the controller, data having a first heat to a first datastream; assigning, by the controller, data having a second heat to asecond data stream; and writing, by the controller, the data streamssimultaneously, in parallel, to page-stripes having a same index acrossa series of planes of memory, wherein the writing of the first datastream begins at an opposite end of the series of planes as the writingof the second data stream, the writing of the streams being toward oneanother.
 2. The computer program product of claim 1, wherein a junctionis defined in one of the page-stripes of a plane from the series ofplanes where the data of the first and second data streams meet.
 3. Thecomputer program product of claim 2, wherein the plane in which thefirst and second data streams meet is dependent upon a rate at which thedata of the first data stream is updated and a rate at which the data ofthe second data stream is updated.
 4. The computer program product ofclaim 1, wherein the first and second heats correspond to a rate atwhich the respective data is updated in the memory.
 5. The computerprogram product of claim 1, wherein a rate at which the data of thefirst data stream is updated is more similar to a rate at which the dataof the second data stream is updated than a rate at which data having athird heat is updated.
 6. The computer program product of claim 1,wherein the memory is in a write cache.
 7. The computer program productof claim 1, wherein the memory is non-volatile memory.
 8. Acomputer-implemented method, comprising: assigning data having a firstheat to a first data stream; assigning data having a second heat to asecond data stream; and writing the data streams simultaneously, inparallel, to page-stripes having a same index across a series of planesof memory, wherein the writing of each data stream begins at a startingposition between ends of the series of planes, wherein each data streamis written from the starting position toward a respective end of theseries of planes.
 9. The computer-implemented method of claim 8, whereinthe starting position is advanced after at least some writing isperformed.
 10. The computer-implemented method of claim 8, wherein thefirst and second heats correspond to a rate at which the respective datais updated in the memory.
 11. The computer-implemented method of claim8, wherein a junction is defined in one of the page-stripes of a planefrom the series of planes where the data of the first and second datastreams meet.
 12. The computer-implemented method of claim 11, whereinthe plane in which the first and second data streams meet is dependentupon a rate at which the data of the first data stream is updated and arate at which the data of the second data stream is updated.
 13. Thecomputer-implemented method of claim 12, wherein the starting positionis advanced incrementally across the series of planes after at leastsome writing is performed, wherein the starting position skips overcertain planes of the series of planes based on preventing additionalwear to the certain planes.
 14. A system, comprising: a memory; acontroller; and logic integrated with and/or executable by thecontroller, the logic being configured to: assign, by the controller,data having a first heat to a first data stream; assign, by thecontroller, data having a second heat to a second data stream; andwrite, by the controller, the data streams simultaneously, in parallel,to page-stripes having a same index across a series of planes of thememory, wherein the writing of each data stream begins at a startingposition between ends of the series of planes, wherein each data streamis written from the starting position toward a respective end of theseries of planes.
 15. The system of claim 14, wherein the startingposition is advanced after at least some writing is performed.
 16. Thesystem of claim 14, wherein the first and second heats correspond to arate at which the respective data is updated in the memory.
 17. Thesystem of claim 14, wherein a junction is defined in one of thepage-stripes of a plane from the series of planes where the data of thefirst and second data streams meet.
 18. The system of claim 17, whereinthe plane in which the first and second data streams meet is dependentupon a rate at which the data of the first data stream is updated and arate at which the data of the second data stream is updated.
 19. Thesystem of claim 18, wherein the starting position is advancedincrementally across the series of planes after at least some writing isperformed, wherein the starting position skips over certain planes ofthe series of planes based on preventing additional wear to the certainplanes.